Bipartite 2-Factorizations of Complete Multipartite Graphs
نویسندگان
چکیده
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipartite 2-factor of K, then there exists a factorisation of K into F ; except that there is no factorisation of K6,6 into F when F is the union of two disjoint 6-cycles.
منابع مشابه
Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs
For any two 2-regular spanning subgraphs G and H of the complete multipartite graph K, necessary and sufficient conditions are found for the existence of a 2-factorization of K in which (1) the first and second 2-factors are isomorphic to G and H respectively, and (2) each other 2-factor is a hamilton cycle, in the case where K has an odd number of vertices.
متن کاملSigned and Minus Domination in Complete Multipartite Graphs
In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which substantially generalizes some previous results obtained for special subclasses of complete multipartite graphs such as cliques and complete bipartite graphs.
متن کاملVarious One-Factorizations of Complete Graphs
Methods to compute 1–factorizations of a complete graphs of even order are presented. For complete graphs where the number of vertices is a power of 2, we propose several new methods to construct 1–factorizations. Our methods are different from methods that make use of algebraic concepts such as Steiner triple systems, starters and all other existing methods. We also show that certain complete ...
متن کاملSharply Transitive 1-Factorizations of Complete Multipartite Graphs
Given a finite group G of even order, which graphs Γ have a 1−factorization admitting G as automorphism group with a sharply transitive action on the vertex-set? Starting from this question, we prove some general results and develop an exhaustive analysis when Γ is a complete multipartite graph and G is cyclic.
متن کاملPartitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
In this paper we consider the problem of partitioning complete multipartite graphs with edges colored by 2 colors into the minimum number of vertex disjoint monochromatic cycles, paths and trees, respectively. For general graphs we simply address the decision version of these three problems the 2-PGMC, 2-PGMP and 2-PGMT problems, respectively. We show that both 2-PGMC and 2-PGMP problems are NP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 78 شماره
صفحات -
تاریخ انتشار 2015